AdWord Auctions: Fairness Without Loss

نویسندگان

  • Sudhir K. Singh
  • Milan Bradonjić
  • Vwani P. Roychowdhury
  • Behnam A. Rezaei
چکیده

We introduce a notion of fairness in the models for sponsored search auctions that provides a chance to new advertisers, as well as, lower budget advertisers to obtain better slots. This enables the search engines (i.e., auctioneers) to estimate the quality or relevance scores for new advertisers, and to better cater to the advertisers in the tail, and thereby encourage more advertisers to participate. We show that such a fairness policy can be incorporated without any significant loss in revenue for the auctioneer, and potentially a gain in the long term, as more players find it profitable and easier to join the game. Additionally, the social value, i.e., efficiency, as measured by the combined value of the auctioneer’s profit and the payoffs of all the bidders, might actually increase. We study revenue and incentive properties of mechanisms for implementing fairness, and justify the above statements.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Characterizing Optimal Adword Auctions

We present a number of models for the adword auctions used for pricing advertising slots on search engines such as Google, Yahoo! etc. We begin with a general problem formulation which allows the privately known valuation per click to be a function of both the identity of the advertiser and the slot. We present a compact characterization of the set of all deterministic incentive compatible dire...

متن کامل

Combinatorial Auctions with Budgets

We consider budget constrained combinatorial auctions where bidder i has a private value vi for each of the items in some set Si, agent i also has a budget constraint bi. The value to agent i of a set of items R is |R ∩ Si| · vi. Such auctions capture adword auctions, where advertisers offer a bid for those adwords that (hopefully) reach their target audience, and advertisers also have budgets....

متن کامل

Capacity Constraints and the Inevitability of Mediators in Adword Auctions

One natural constraint in the sponsored search advertising framework arises from the fact that there is a limit on the number of available slots, especially for the popular keywords, and as a result, a significant pool of advertisers are left out. We study the emergence of diversification in the adword market triggered by such capacity constraints in the sense that new market mechanisms, as wel...

متن کامل

CORC Report TR - 2006 - 04 Characterizing Optimal Adword Auctions ∗

We present a number of models for the adword auctions used for pricing advertising slots on search engines such as Google, Yahoo! etc. We begin with a general problem formulation which allows the privately known valuation per click to be a function of both the identity of the advertiser and the slot. We present a compact characterization of the set of all deterministic incentive compatible dire...

متن کامل

Optimal Sample Size for Adword Auctions

Generalized Second Price (GSP) mechanism is widely used in ad auctions and reserve price is an effective tool for revenue maximization. The optimal reserve price depends on bidders’ value distribution, which, however, is generally unknown to auctioneers. A common practice for auctioneers is to first collect information about the value distribution by a sampling procedure and then apply the rese...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008